Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Robust RGB-D SLAM system incorporating instance segmentation and clustering in dynamic environment
Tianzouzi XIAO, Xiaobo ZHOU, Xin LUO, Qipeng TANG
Journal of Computer Applications    2023, 43 (4): 1220-1225.   DOI: 10.11772/j.issn.1001-9081.2022020261
Abstract247)   HTML3)    PDF (2537KB)(133)       Save

Visual Simultaneous Location And Mapping (VSLAM) technology is commonly used for indoor robot navigation and perception. However, the pose estimation method of VSLAM aims at static environment, and might lead to the location and mapping failure when moving objects exist in the scene. To solve this problem, an Instance Segmentation and Clustering SLAM (ISC-SLAM) system was proposed. In this system, the instance segmentation network was used to generate the possibility masks of dynamic objects in the scene, and the dynamic points in the scene were detected by using the multi-view geometry method during the segmentation. After matching the obtained possibility masks and the detected dynamic points, the accurate dynamic masks of moving objects were determined. The feature points of the dynamic objects were able to be deleted by using the dynamic masks and then the position of camera was estimated accurately by using the remained static feature points. To solve the under-segmentation problem of the instance segmentation network, the depth filling algorithm and clustering algorithm were applied to ensure the completed deletion elimination of dynamic feature points. Finally, the moving objects obscured background was reconstructed, and the static point cloud map was built with the correct camera pose. Experimental results on Technical University of Munich (TUM) dataset demonstrate that the proposed system can achieve robust positioning and mapping while ensuring real-time performance in dynamic environment.

Table and Figures | Reference | Related Articles | Metrics
Property preserving operation for simplifying Petri nets with inhibitor arcs
MO Li-ping YUE Xiaobo ZHOU Kai-qing ZHANG Zhao-hai
Journal of Computer Applications    2012, 32 (11): 3071-3074.   DOI: 10.3724/SP.J.1087.2012.03071
Abstract1047)      PDF (596KB)(368)       Save
Petri nets simplification of property preservation is a significant approach for Petri nets analysis. Meanwhile, the computational ability of Petri nets with inhibitor arcs is equal to Turing machine. From the perspective of series transition and series places respectively, this paper proposed two simplified methods of the Petri nets with inhibitor arcs. Finally, it proved that the characteristics such as aliveness, boundedness and weak fairness of simplified Petri nets with inhibitor arcs were kept unanimous with the original Petri nets with inhibitor arcs by these methods.
Reference | Related Articles | Metrics
Dynamic feature research into simplifying technology of Petri nets
YAN Bozhao YUE Xiaobo ZHOU Kaiqing MO Liping
Journal of Computer Applications    2011, 31 (06): 1641-1644.   DOI: 10.3724/SP.J.1087.2011.01641
Abstract1252)      PDF (486KB)(598)       Save
For the large and complicated Petri nets, the main problem hindering the technology development is always that "too many nodes lead to station explosion". Therefore, how to simplify Petri nets effectively has always been a research focus and to simplify it to be several subnets is a very effective method. With the decomposition method of Petri nets by defining an index function on the place set, this paper gave the decomposed definition of Petri nets and proposed the related algorithms. Based on the above research, according to the dynamic feature of simplifying technology via researches of the given algorithms, the authors studied the special properties of subnet correspondingly and provided an efficient approach to analyze the Petri nets of complicated systems.
Related Articles | Metrics